Springs can provide force at zero net energy cost by recycling negative mechanical work to benefit motor-driven robots or spring-augmented humans. However, humans have limited force and range of motion, and motors have a limited ability to produce force. These limits constrain how much energy a conventional spring can store and, consequently, how much assistance a spring can provide. In this paper, we introduce an approach to accumulating negative work in assistive springs over several motion cycles. We show that, by utilizing a novel floating spring mechanism, the weight of a human or robot can be used to iteratively increase spring compression, irrespective of the potential energy stored by the spring. Decoupling the force required to compress a spring from the energy stored by a spring advances prior works, and could enable spring-driven robots and humans to perform physically demanding tasks without the use of large actuators.

Artificial intelligence methods including deep neural networks (DNN) can provide rapid molecular classification of tumors from routine histology with accuracy that matches or exceeds human pathologists. Discerning how neural networks make their predictions remains a significant challenge, but explainability tools help provide insights into what models have learned when corresponding histologic features are poorly defined. Here, we present a method for improving explainability of DNN models using synthetic histology generated by a conditional generative adversarial network (cGAN). We show that cGANs generate high-quality synthetic histology images that can be leveraged for explaining DNN models trained to classify molecularly-subtyped tumors, exposing histologic features associated with molecular state. Fine-tuning synthetic histology through class and layer blending illustrates nuanced morphologic differences between tumor subtypes. Finally, we demonstrate the use of synthetic histology for augmenting pathologist-in-training education, showing that these intuitive visualizations can reinforce and improve understanding of histologic manifestations of tumor biology.

给定一个单眼视频，在恢复静态环境时进行分割和解耦动态对象是机器智能中广泛研究的问题。现有的解决方案通常在图像域中解决此问题，从而限制其对环境的性能和理解。我们介绍了脱钩的动态神经辐射场（D $^2 $ nerf），这是一种自制的方法，采用单眼视频，并学习了一个3D场景表示，该表示将移动对象（包括它们的阴影）从静态背景中解脱出来。我们的方法通过两个单独的神经辐射场表示移动对象和静态背景，只有一个允许时间变化。这种方法的幼稚实现导致动态组件接管静态的成分，因为前者的表示本质上更一般并且容易过度拟合。为此，我们提出了一种新颖的损失，以促进现象的正确分离。我们进一步提出了一个阴影场网络，以检测和解除动态移动的阴影。我们介绍了一个新的数据集，其中包含各种动态对象和阴影，并证明我们的方法可以在解耦动态和静态3D对象，遮挡和阴影删除以及移动对象的图像分段中获得比最新方法更好的性能。

地球天气和气候的数值模拟需要大量的计算。这导致替换替换具有在推理时间快速的近似机器学习（ml）方法的子程序来替换的子程序感兴趣。在天气和气候模型中，大气辐射转移（RT）计算特别昂贵。这使他们成为了基于神经网络的仿真器的流行目标。然而，由于缺乏缺乏全面的数据集和ML基准测试的标准化最佳实践，事先工作难以比较。为了填补这个差距，我们建立一个大型数据集，比加拿大地球系统模型为基础的大型数据集，高于\ emph {1000万个样本，未来的气候条件}。 Climart为ML社区带来了几种方法论挑战，例如多次分发试验集，底层域物理学和准确性和推广速度之间的权衡。我们还提出了几种新颖的基线，这些基线表示现有工作中使用的数据集和网络架构的缺点。下载说明，基准和代码可提供：https：//github.com/rolnicklab/climart

对头部磁共振成像（MRI）检查的需求不断增长，以及全球放射科医生的短缺，导致在全球报告头部MRI扫描所花费的时间增加。对于许多神经系统疾病，这种延迟会导致发病率和死亡率增加。一种自动分解工具可以通过在成像时识别异常并确定这些扫描的报告优先级来减少异常检查的报告时间。在这项工作中，我们提出了一个卷积神经网络，用于检测$ \ text {t} _2 $加权的头部MRI扫描中临床上相关的异常。使用经过验证的神经放射学报告分类器，我们从两家英国两家大型医院进行了43,754张标记的数据集，以进行模型培训，并在800张测试集上证明了准确的分类（AUC下的区域（AUC）= 0.943），由800张扫描集进行了标签。神经放射学家团队。重要的是，当仅在一家医院接受扫描培训时，模型从另一家医院进行了扫描（$ \ delta $ auc $ \ leq $ 0.02）。一项模拟研究表明，我们的模型将使异常检查的平均报告时间从28天到14天，并从两家医院的9天到5天，这表明在临床分类环境中使用了可行性。

Variational inference uses optimization, rather than integration, to approximate the marginal likelihood, and thereby the posterior, in a Bayesian model. Thanks to advances in computational scalability made in the last decade, variational inference is now the preferred choice for many high-dimensional models and large datasets. This tutorial introduces variational inference from the parametric perspective that dominates these recent developments, in contrast to the mean-field perspective commonly found in other introductory texts.

Knowledge graphs (KG) have served as the key component of various natural language processing applications. Commonsense knowledge graphs (CKG) are a special type of KG, where entities and relations are composed of free-form text. However, previous works in KG completion and CKG completion suffer from long-tail relations and newly-added relations which do not have many know triples for training. In light of this, few-shot KG completion (FKGC), which requires the strengths of graph representation learning and few-shot learning, has been proposed to challenge the problem of limited annotated data. In this paper, we comprehensively survey previous attempts on such tasks in the form of a series of methods and applications. Specifically, we first introduce FKGC challenges, commonly used KGs, and CKGs. Then we systematically categorize and summarize existing works in terms of the type of KGs and the methods. Finally, we present applications of FKGC models on prediction tasks in different areas and share our thoughts on future research directions of FKGC.

Few Shot Instance Segmentation (FSIS) requires models to detect and segment novel classes with limited several support examples. In this work, we explore a simple yet unified solution for FSIS as well as its incremental variants, and introduce a new framework named Reference Twice (RefT) to fully explore the relationship between support/query features based on a Transformer-like framework. Our key insights are two folds: Firstly, with the aid of support masks, we can generate dynamic class centers more appropriately to re-weight query features. Secondly, we find that support object queries have already encoded key factors after base training. In this way, the query features can be enhanced twice from two aspects, i.e., feature-level and instance-level. In particular, we firstly design a mask-based dynamic weighting module to enhance support features and then propose to link object queries for better calibration via cross-attention. After the above steps, the novel classes can be improved significantly over our strong baseline. Additionally, our new framework can be easily extended to incremental FSIS with minor modification. When benchmarking results on the COCO dataset for FSIS, gFSIS, and iFSIS settings, our method achieves a competitive performance compared to existing approaches across different shots, e.g., we boost nAP by noticeable +8.2/+9.4 over the current state-of-the-art FSIS method for 10/30-shot. We further demonstrate the superiority of our approach on Few Shot Object Detection. Code and model will be available.

Unsupervised domain adaptation (UDA) for semantic segmentation is a promising task freeing people from heavy annotation work. However, domain discrepancies in low-level image statistics and high-level contexts compromise the segmentation performance over the target domain. A key idea to tackle this problem is to perform both image-level and feature-level adaptation jointly. Unfortunately, there is a lack of such unified approaches for UDA tasks in the existing literature. This paper proposes a novel UDA pipeline for semantic segmentation that unifies image-level and feature-level adaptation. Concretely, for image-level domain shifts, we propose a global photometric alignment module and a global texture alignment module that align images in the source and target domains in terms of image-level properties. For feature-level domain shifts, we perform global manifold alignment by projecting pixel features from both domains onto the feature manifold of the source domain; and we further regularize category centers in the source domain through a category-oriented triplet loss and perform target domain consistency regularization over augmented target domain images. Experimental results demonstrate that our pipeline significantly outperforms previous methods. In the commonly tested GTA5$\rightarrow$Cityscapes task, our proposed method using Deeplab V3+ as the backbone surpasses previous SOTA by 8%, achieving 58.2% in mIoU.

The development of social media user stance detection and bot detection methods rely heavily on large-scale and high-quality benchmarks. However, in addition to low annotation quality, existing benchmarks generally have incomplete user relationships, suppressing graph-based account detection research. To address these issues, we propose a Multi-Relational Graph-Based Twitter Account Detection Benchmark (MGTAB), the first standardized graph-based benchmark for account detection. To our knowledge, MGTAB was built based on the largest original data in the field, with over 1.55 million users and 130 million tweets. MGTAB contains 10,199 expert-annotated users and 7 types of relationships, ensuring high-quality annotation and diversified relations. In MGTAB, we extracted the 20 user property features with the greatest information gain and user tweet features as the user features. In addition, we performed a thorough evaluation of MGTAB and other public datasets. Our experiments found that graph-based approaches are generally more effective than feature-based approaches and perform better when introducing multiple relations. By analyzing experiment results, we identify effective approaches for account detection and provide potential future research directions in this field. Our benchmark and standardized evaluation procedures are freely available at: https://github.com/GraphDetec/MGTAB.